Set-based Error Diagnosis of Concurrent Constraint Programs

نویسندگان

  • Andreas Podelski
  • Witold Charatonik
چکیده

We present an automated method for the static prediction of the runtime error`deadlock or failure' in concurrent constraint programs. Operationally, the method is based on a new set-based analysis of reactive logic programs which computes an approximation of the greatest-model semantics. Semantically , the method is based on the connection between the inevitability of`deadlock or failure' in concurrent constraint programs, nite failure in logic programming and the greatest-model semantics over innnite trees.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs

This paper presents the first approximation method of the finite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs with ongoing behaviors (perpetual processes). Our technical contributions are (1) the semantical characterization of finite failure of logic programs over infinite trees and (2) the design and soundness proof of the...

متن کامل

Set based failure diagnosis for concurrent constraint programming

Concurrent constraint (CC) programming is a simple and powerful high-level model for concurrent programming. The expressiveness of the CC model has been considerably extended by the Oz Programming Model (OPM) which is realised in the programming language Oz. Oz subsumes well-established programming paradigms such as higher-order functional and object-oriented programming, and it supports proble...

متن کامل

Declarative Diagnosis of Temporal Concurrent Constraint Programs

We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous) immediate consequence operator, TD, which models the process behaviour associated with a program D given in terms of sequences of constraints. Then, we show that, given the intended specification of D, it is possible to check ...

متن کامل

Abstract diagnosis for timed concurrent constraint programs

diagnosis for timed concurrent constraint programs! MARCO COMINI and LAURA TITOLO Dipartimento di Matematica e Informatica University of Udine Via delle Scienze, 206 33100 Udine, Italy (e-mail: {marco.comini,laura.titolo}@uniud.it)

متن کامل

ar X iv : c s . SE / 0 01 20 07 v 3 5 J an 2 00 1 Kima – an Automated Error Correction System for Concurrent Logic Programs

We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explicit declarations of program properties. Strong moding/typing and constraint-based analysis are turning to play fundamental roles in debugging concurrent logic programs as well as in establishing the consistency of commu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997